Local linear convergence analysis of Primal–Dual splitting methods

In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice.     

The martingale problem for a class of nonlocal operators of diagonal type

We consider systems of stochastic differential equations of the form $$\begin{array}{c}\hfill d{X}_t^i=\sum _{j=1}^d{A}_{ij}\left(X_{t?}\right)d{Z}_t^j\end{array}$$ for $i=1,?,d$ with continuous, bounded and non‐degenerate coefficients. Here $Z_t^1,?,Z_t^d$ are independent one‐dimensional stable processes with ${\alpha }_1,?,{\alpha }_d\in (0,2)$. In this article we research on uniqueness of weak solutions to such systems by studying the corresponding martingale problem. We prove the uniqueness of weak solutions in the case of diagonal coefficient matrices.     

Singular Hamiltonian elliptic systems with critical exponential growth in dimension two

We will focus on the existence of nontrivial solutions to the following Hamiltonian elliptic system where are numbers belonging to the interval [0, 2), V is a continuous potential bounded below on by a positive constant and the functions f and g possess exponential growth range established by Trudinger–Moser inequalities in Lorentz–Sobolev spaces. The proof involves linking theorem and a finite‐dimensional approximation.     

Necessary and Sufficient Conditions for Qualitative Properties of Infinite Dimensional Linear Programming Problems

Necessary and sufficient conditions for qualitative properties of infinite dimensional linear programing problems such as solvability, duality, and complementary slackness conditions are studied in this article. As illustrations for the results, we investigate the parametric version of Gale’s example.     

Solvability of a nonlinear fifth‐order difference equation

Some formulas for well‐defined solutions to four very special cases of a nonlinear fifth‐order difference equation have been presented recently in this journal, where some of them were proved by the method of induction, some are only quoted, and no any theory behind the formulas was given. Here, we show in an elegant constructive way how the general solution to the difference equation can be obtained, from which the special cases very easily follow, which is also demonstrated here. We also give some comments on the local stability results on the special cases of the nonlinear fifth‐order difference equation previously publish in this journal.     

含分布时滞的时滞微分系统多步龙格-库塔方法的时滞相关稳定性

本文研究了一类含分布时滞的时滞微分系统的多步龙格-库塔方法的稳定性.基于辐角原理，本文给出了多步龙格-库塔方法弱时滞相关稳定性的充分条件，并通过数值算例验证了理论结果的有效性.     

Unconditionally Superclose Analysis of a New Mixed Finite Element Method for Nonlinear Parabolic Equation

This paper develops a framework to deal with the unconditional superclose analysis of nonlinear parabolic equation. Taking the finite element pair $Q_{11}/Q_{01} × Q_{10}$ as an example, a new mixed finite element method (FEM) is established and the $τ$ -independent superclose results of the original variable $u$ in $H^1$-norm and the flux variable $\mathop{q} \limits ^{\rightarrow}= −a(u)∇u$ in $L^2$-norm are deduced ($τ$ is the temporal partition parameter). A key to our analysis is an error splitting technique, with which the time-discrete and the spatial-discrete systems are constructed, respectively. For the first system, the boundedness of the temporal errors is obtained. For the second system, the spatial superclose results are presented unconditionally, while the previous literature always only obtain the convergent estimates or require certain time step conditions. Finally, some numerical results are provided to confirm the theoretical analysis, and show the efficiency of the proposed method.     

Some extensions of the operator entropy type inequalities

In this paper, we define the generalised relative operator entropy and investigate some of its properties such as subadditivity and homogeneity. As application of our result, we obtain the information inequality. In continuation, we establish some reverses of the operator entropy inequalities under certain conditions by using the Mond–Pe?ari? method.     

Linearly χ-bounding (P6, C4)-free graphs*

Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time.     

On the Relative Gain Array (RGA) with singular and rectangular matrices

This paper identifies a significant deficiency in the literature on the application of the Relative Gain Array (RGA) formalism in the case of singular matrices. Specifically, it is shown that the conventional use of the Moore–Penrose pseudoinverse is inappropriate because it fails to preserve critical properties that can be assumed in the nonsingular case. It is then shown that such properties can be rigorously preserved using an alternative generalized matrix inverse.